Informatics Publishing Limited

Avani R. Vasant ¹, Sandeep R. Vasant ², G. R. Kulkarni ³

Affiliations
1 Shinghania University, Rajasthan, IN
2 Saurashtra University, Gujarat, IN
3 C.U. Shah College of Engineering Technology, Wadhwan, IN

Abstract

Handwritten Documents are very important part of the day-to-day life. Documents are very important for the communication purpose. With the invention of the Digital Computers and machine learning algorithms the automatic reading of such handwritten documents using Computer has been addressed by many researchers. Such automated Systems enables computers to process handwritten documents faster and efficient. In order to implement a very good recognition system that gives higher recognition rates, we need various pre-processing steps to be applied to the handwritten documents. This paper presents various pre-processing steps to be applied to the offline scanned Gujarati Handwritten Characters.

Keywords

Gujarati Characters, Pre-Processing, Recognition.

Full Text

     

Sandeep R. Vasant ¹, Avani R. Vasant ², N. N. Jani ³, Swapnil S. Marathe ⁴

Affiliations
1 Saurashtra University, Gujarat, IN
2 Shinghania University, Rajasthan, IN
3 S K Patel Institute of Computer Studies, Kadi Sarva Vishwa Vidyalya, Gandhinagar, Gujarat, IN
4 M.S. University, Baroda, Gujarat, IN

Abstract

The human race is facing a large number of very complex real-world problems. One of them is a very common and typical problem faced by many large organizations executing multiple projects concurrently. They have a huge pool of similarly skilled human resource (experts) which needs to be allocated to multiple projects with different units of work and different payment rates such that each expert gets an equitable payment. The above problem is an allocation problem and it falls into the category of NP Hard problems. A simple and obvious approach could be application of Round robin technique to this problem. However, this technique is not suitable and has a set of limitations. As per no polynomial-time algorithm exists to solve this problem optimally. In this paper we have introduced a novel Genetic Algorithm based approach with problem specific three-dimensional representation scheme to find the optimal solution for the equitable payment distribution. We have implemented an algorithm that achieves average performance which is close to the optimal across many experimental scenarios. Furthermore, this evolutionary algorithm does not require special high powered computing hardware and is still quite efficient. This makes it ideally suitable for solving this type of allocation problems.

Keywords

Project, Experts, NP (Non Polynomial), Round Robin, Genetic Algorithm, Exhaustive Search, Elitism, Crossover, Mutation.

Full Text